Proof-Search and Countermodel Generation in Propositional BI Logic
Identifieur interne : 009306 ( Main/Exploration ); précédent : 009305; suivant : 009307Proof-Search and Countermodel Generation in Propositional BI Logic
Auteurs : Didier Galmiche [France] ; Daniel Méry [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Descripteurs français
- Pascal (Inist)
English descriptors
Abstract
Abstract: In this paper, we study proof-search in the propositional BI logic that can be viewed as a merging of intuitionistic logic and multiplicative intuitionistic linear logic. With its underlying sharing interpretation, BI has been recently used for logic programming or reasoning about mutable data structures. We propose a labelled tableau calculus for BI, the use of labels making it possible to generate countermodels. We show that, from a given formula A, a non-redundant tableau construction procedure terminates and yields either a tableau proof of A or a countermodel of A in terms of the Kripke resource monoid semantics. Moreover, we show the finite model property for BI with respect to this semantics.
Url:
DOI: 10.1007/3-540-45500-0_13
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001032
- to stream Istex, to step Curation: 001016
- to stream Istex, to step Checkpoint: 001E48
- to stream Main, to step Merge: 009828
- to stream PascalFrancis, to step Corpus: 000900
- to stream PascalFrancis, to step Curation: 000152
- to stream PascalFrancis, to step Checkpoint: 000890
- to stream Main, to step Merge: 009973
- to stream Main, to step Curation: 009306
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Proof-Search and Countermodel Generation in Propositional BI Logic</title><author><name sortKey="Galmiche, Didier" sort="Galmiche, Didier" uniqKey="Galmiche D" first="Didier" last="Galmiche">Didier Galmiche</name></author><author><name sortKey="Mery, Daniel" sort="Mery, Daniel" uniqKey="Mery D" first="Daniel" last="Méry">Daniel Méry</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:456A9BFFC1BE7E11D1D6046D78A6C0AD62E63228</idno><date when="2001" year="2001">2001</date><idno type="doi">10.1007/3-540-45500-0_13</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-V7WX8KB4-Q/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001032</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001032</idno><idno type="wicri:Area/Istex/Curation">001016</idno><idno type="wicri:Area/Istex/Checkpoint">001E48</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001E48</idno><idno type="wicri:doubleKey">0302-9743:2001:Galmiche D:proof:search:and</idno><idno type="wicri:Area/Main/Merge">009828</idno><idno type="wicri:source">INIST</idno><idno type="RBID">Pascal:02-0060254</idno><idno type="wicri:Area/PascalFrancis/Corpus">000900</idno><idno type="wicri:Area/PascalFrancis/Curation">000152</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000890</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000890</idno><idno type="wicri:doubleKey">0302-9743:2001:Galmiche D:proof:search:and</idno><idno type="wicri:Area/Main/Merge">009973</idno><idno type="wicri:Area/Main/Curation">009306</idno><idno type="wicri:Area/Main/Exploration">009306</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Proof-Search and Countermodel Generation in Propositional BI Logic</title><author><name sortKey="Galmiche, Didier" sort="Galmiche, Didier" uniqKey="Galmiche D" first="Didier" last="Galmiche">Didier Galmiche</name><affiliation wicri:level="4"><country xml:lang="fr">France</country><wicri:regionArea>LORIA — Université Henri Poincaré, Campus Scientifique, BP 239, 54506, Vandoeuvre-lès-Nancy</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement></placeName><orgName type="university">Université Henri Poincaré</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Mery, Daniel" sort="Mery, Daniel" uniqKey="Mery D" first="Daniel" last="Méry">Daniel Méry</name><affiliation wicri:level="4"><country xml:lang="fr">France</country><wicri:regionArea>LORIA — Université Henri Poincaré, Campus Scientifique, BP 239, 54506, Vandoeuvre-lès-Nancy</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement></placeName><orgName type="university">Université Henri Poincaré</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Logical programming</term><term>Proof theory</term><term>Propositional logic</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Logique propositionnelle</term><term>Programmation logique</term><term>Théorie preuve</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: In this paper, we study proof-search in the propositional BI logic that can be viewed as a merging of intuitionistic logic and multiplicative intuitionistic linear logic. With its underlying sharing interpretation, BI has been recently used for logic programming or reasoning about mutable data structures. We propose a labelled tableau calculus for BI, the use of labels making it possible to generate countermodels. We show that, from a given formula A, a non-redundant tableau construction procedure terminates and yields either a tableau proof of A or a countermodel of A in terms of the Kripke resource monoid semantics. Moreover, we show the finite model property for BI with respect to this semantics.</div></front></TEI><affiliations><list><country><li>France</li></country><region><li>Grand Est</li><li>Lorraine (région)</li></region><settlement><li>Vandœuvre-lès-Nancy</li></settlement><orgName><li>Université Henri Poincaré</li></orgName></list><tree><country name="France"><region name="Grand Est"><name sortKey="Galmiche, Didier" sort="Galmiche, Didier" uniqKey="Galmiche D" first="Didier" last="Galmiche">Didier Galmiche</name></region><name sortKey="Galmiche, Didier" sort="Galmiche, Didier" uniqKey="Galmiche D" first="Didier" last="Galmiche">Didier Galmiche</name><name sortKey="Mery, Daniel" sort="Mery, Daniel" uniqKey="Mery D" first="Daniel" last="Méry">Daniel Méry</name><name sortKey="Mery, Daniel" sort="Mery, Daniel" uniqKey="Mery D" first="Daniel" last="Méry">Daniel Méry</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 009306 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 009306 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:456A9BFFC1BE7E11D1D6046D78A6C0AD62E63228
|texte= Proof-Search and Countermodel Generation in Propositional BI Logic
}}
| This area was generated with Dilib version V0.6.33. |  |